Optimal Solution for Multi-Objective Facility Layout Problem Using Genetic Algorithm
نویسنده
چکیده
This paper addresses optimization of multi-objective facility layout problem. Facility layout plays a key role for companies, and it is an inseparable part of the manufacturing system design process. Traditionally there are two approaches to the facility layout problem. One is the quantitative approach aiming at minimizing the total material handling cost and another is qualitative approach aiming at maximizing closeness rating score. In this paper both approaches have been taken into consideration separately. Again, the research also solved the problem combining these two approaches at the objective function level. Genetic algorithm (GA) is developed for the multi-objective facility layout problem and found out the optimal facility location for a particular problem considering the two objectives, i.e. minimization of the material handling cost and maximization of the closeness rating score. In GA, primarily an initial population is created and by the crossover operator and mutation process new offspring is generated and if the offspring meet the stopping criteria the result was selected for the process. From this approach, a non dominated solution set is found (Pareto optimal) approximately for the multi objective facility layout problem.
منابع مشابه
A Quaternion Firefly Algorithm to Solve a Multi-row Facility Layout Problem (RESEARCH NOTE)
In this paper, a quaternion firefly algorithm is utilized to solve a multi-row facility layout design problem with the objective of minimizing the total cost of transportation. A quaternion firefly algorithm takes the motion of the firefly as a quaternion one. Consequently, the solution space is explored more accurately and the answers are of higher quality. That is, the answers are considerabl...
متن کاملA Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem
This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...
متن کاملA Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA
A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...
متن کاملA Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm
One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...
متن کاملA full ranking method using integrated DEA models and its application to modify GA for finding Pareto optimal solution of MOP problem
This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...
متن کامل